Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
نویسندگان
چکیده
We introduce algorithms for lattice basis reduction that are improvements of the famous L 3-algorithm. If a random L 3 {reduced lattice basis b1; : : : ; bn is given such that the vector of reduced Gram{ Schmidt coeecients (fi;jg 1 j < i n) is uniformly distributed in 0; 1) (n 2) , then the pruned enumeration nds with positive probability a shortest lattice vector. We demonstrate the power of these algorithms by solving random subset sum problems of arbitrary density with 74 and 82 many weights, by breaking the Chor{Rivest cryptoscheme in dimensions 103 and 151 and by breaking Damg ard's hash function.
منابع مشابه
Low-density attack revisited
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost all the problems of density < 0.9408... in the asymptotical sense. On the other hand, the subset sum problem itself is known as an NP-hard problem, and a lot of efforts have been paid to establish public-key cryptosyste...
متن کاملMerkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations
Cryptosystems based on the knapsack problem were among the rst public key systems to be invented and for a while were considered quite promising. Basically all knapsack cryptosystems that have been proposed so far have been broken, mainly by means of lattice reduction techniques. However, a few knapsack-like cryptosystems have withstood cryptanalysis, among which the Chor-Rivest scheme 2] even ...
متن کاملAlgorithms to encrypt and decrypt messages with Magma ∗
The security in current communications recommend to develop the implementation of cryptographic primitives and algorithms in an effective way. The cryptosystem proposed by Chor and Rivest, which is based on the knapsack problem, has recently been broken by Vaudenay but only when the original parameters are used. In this paper we give a brief overview of some developments in Cryptography and we ...
متن کاملe-LEARNING: A CASE STUDY OF CHOR-RIVEST CRYPTOSYSTEM IN MAPLE
A new experience teaching programming and numerical methods to engineering students, using Maple to implement the Chor-Rivest cryptosystem, is shown. The aim is to give the students a better understanding of cryptography by using Maple software. In this paper we discuss our attempts to structure an on-line course that required the students participation, interest, and evaluation by means of a new
متن کاملSafer parameters for the Chor-Rivest cryptosystem
Vaudenay’s cryptanalysis to Chor-Rivest cryptosystem is not applicable if the parameters p and h of the finite field are both prime integers. This case is analyzed below and the parameters for which such cryptosystem is cryptographically interesting are listed. Regrettably the resulting cryptosystems are not very efficient in practice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 2 شماره
صفحات -
تاریخ انتشار 1995